Optimized Backtracking for Subgraph Isomorphism
نویسندگان
چکیده
منابع مشابه
Filtering for Subgraph Isomorphism
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this problem. The main idea is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to express compatibility of labels for subgraph iso...
متن کاملLower Bounds for Subgraph Isomorphism
We consider the computational complexity of determining whether an Erdős-Rényi random graph contains a subgraph isomorphic to a fixed pattern, such as a clique or cycle of constant size. We give an overview of unconditional lower bounds for this problem, focusing on circuits and formulas in the AC 0 and monotone settings. 1 Background and preliminaries The subgraph isomorphism problem is the co...
متن کاملBetween Subgraph Isomorphism and Maximum Common Subgraph
When a small pattern graph does not occur inside a larger target graph, we can ask how to find “as much of the pattern as possible” inside the target graph. In general, this is known as the maximum common subgraph problem, which is much more computationally challenging in practice than subgraph isomorphism. We introduce a restricted alternative, where we ask if all but k vertices from the patte...
متن کاملOn Subgraph Isomorphism
Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.
متن کاملPlanar Subgraph Isomorphism Revisited
The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstein [SODA 95, J’GAA 99] gives the first linear time algorithm for subgraph isomorphism for a fixed-size pattern, say of order k, and arbitrary planar host graph, improving upon the O(n √ )-time algorithm when using the “Color-codi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Management Systems
سال: 2012
ISSN: 0975-5985
DOI: 10.5121/ijdms.2012.4601